confluent relation

confluent relation: French\ \ relation confluent

German\ \ Konfluenzrelation

Dutch\ \ multicollineariteit

Italian\ \ relazione confluenziale

Spanish\ \ relación confluents

Catalan\ \ relació confluent

Portuguese\ \ relação confluente

Romanian\ \ -

Danish\ \ sammenflydende forhold

Norwegian\ \ konfluent forhold

Swedish\ \ konfluenta förhållande

Greek\ \ συρρέουσες σχέση

Finnish\ \ konfluenssianalyysi

Hungarian\ \ egybefolyó kapcsolat

Turkish\ \ eş-gidiş ilişkisi

Estonian\ \ assimilatsiooniseos

Lithuanian\ \ konfliuenčioji sąsaja; sankirtos sąsaja; konfliuentusis priklausomumas; sankirtos priklausomumas

Slovenian\ \ zraščene zvezi

Polish\ \ zależność konfluencyjna

Russian\ \ конфлюентные отношения

Ukrainian\ \ -

Serbian\ \ -

Icelandic\ \ -

Euskara\ \ -

Farsi\ \ -

Persian-Farsi\ \ -

Arabic\ \ علاقة تشابك

Afrikaans\ \ saamvloeiende verband

Chinese\ \ 合流关系

Korean\ \ 합류관계

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

Confluent hypergeometric function — In mathematics, a confluent hypergeometric function is a solution of a confluent hypergeometric equation, which is a degenerate form of a hypergeometric differential equation where two of the three regular singularities merge into an irregular… … Wikipedia
Directed relation — A directed relation or confluent relation is a mathematical relation in which::(w,x,y,z in X) (x)(y)(z)((Rxy and Rxz) imp (existw)(Ryw and Rzw))Also called diamond, amalgamation, weakly directed, or directly confluent … Wikipedia
Recurrence relation — Difference equation redirects here. It is not to be confused with differential equation. In mathematics, a recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the… … Wikipedia
Abstract rewriting system — In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviation ARS) is a formalism that captures the quintessential notion and properties of… … Wikipedia
Knuth-Bendix completion algorithm — The Knuth Bendix completion algorithm is an algorithm for transforming a set of equations (over terms) into a confluent term rewriting system. When the algorithm succeeds, it has effectively solved the word problem for the specified algebra. An… … Wikipedia
Hermite polynomials — In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence that arise in probability, such as the Edgeworth series; in combinatorics, as an example of an Appell sequence, obeying the umbral calculus; in numerical… … Wikipedia
Confluence (term rewriting) — Confluence is a property of term rewriting systems, describing that terms in this system can be rewritten in more than one way, to yield the same result. Motivating example Consider the rules of regular arithmetic. We can think of these rules as… … Wikipedia
Lyon — Cet article concerne la ville française. Pour les autres significations, voir Lyon (homonymie). 45° 45′ 35″ N 4° 50′ 32″ … Wikipédia en Français
Ouysse — L Ouysse après les résurgences près du moulin de Caoulet. Bassin de l … Wikipédia en Français
Vallée du Rhône (France) — Pour les articles homonymes, voir Vallée du Rhône. Vallée du Rhône Vue de la vallée du Rhône du haut du vignoble de Tain l Hermitage Massif Vercors / … Wikipédia en Français
Coblence — Traduction à relire Koblenz → Coblence (+ … Wikipédia en Français

Academic Dictionaries and Encyclopedias

confluent relation

Look at other dictionaries:

Share the article and excerpts

Academic Dictionaries and Encyclopedias

Statistical terms

confluent relation

Look at other dictionaries:

Share the article and excerpts

Direct link